On the chromatic number of special distance graphs
نویسندگان
چکیده
منابع مشابه
Chromatic number of graphs with special distance sets, I
Given a subset D of positive integers, an integer distance graph is a graphG(Z, D) with the set Z of integers as vertex set and with an edge joining two vertices u and v if and only if |u−v| ∈ D. In this paper we consider the problem of determining the chromatic number of certain integer distance graphs G(Z, D)whose distance set D is either 1) a set of (n + 1) positive integers for which the n ...
متن کاملThe locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملPacking Chromatic Number of Distance Graphs
The packing chromatic number (G) of a graph G is the smallest integer k such that vertices of G can be partitioned into disjoint classes X1; :::; Xk where vertices in Xi have pairwise distance greater than i. We study the packing chromatic number of in nite distance graphs G(Z; D), i.e. graphs with the set Z of integers as vertex set and in which two distinct vertices i; j 2 Z are adjacent if a...
متن کاملDistance graphs with maximum chromatic number
Let D be a finite set of integers. The distance graph G(D) has the set of integers as vertices and two vertices at distance d ∈ D are adjacent in G(D). A conjecture of Xuding Zhu states that if the chromatic number of G(D) achieves its maximum value |D| + 1 then the graph has a clique of order |D|. We prove that the chromatic number of a distance graph with D = {a, b, c, d} is five if and only ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1991
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90454-a